n,m = map(int,input().split())
class Solution():
    def __init__(self):
        self.res = 0
    def dfs(self,cur,p,q):
        if len(cur) == n:
            self.res += 0
        else:
            for i in range(p,q+1):
                if i%cur[-1]==0:
                 self.dfs(cur+[i],p+1,q)

